新型舰炮武器系统的自动检测系统

阐述了某新型舰炮武器系统应用仿真技术、控制技术、网络技术和信息处理技术实现自动检测,以及自动检测系统的组成和工作原理。用内模拟仿真驱动技术,实现了舰炮武器系统全自动工作方式下的点迹提取、航迹建立、目标识别、威胁判断、目标指示、捕获跟踪、求解射击诸元,全系统动态联动精度在线评估,以及在线实时故障检测。为海军新装备的操作、使用和维护提供了有效的技术手段。将提高系统可维性和生命力。     

基于复杂网络的作战网络分析

分布式网络化作战是网络中心战的基础,而分布式作战网络的构建是网络化作战的重要前提。首先,运用复杂网络的相关参数分析了多种不同的网络,选择了BA非标度网络作为分布式作战网络的最优表现形式;其次,以BA非标度网络为基础提出了一个适合军事上动态鲁棒性分析的模型DCNCE;最后,仿真结果表明,在以网络效能值为测度的对比下,分布式作战网络在介数毁伤策略下更脆弱,为构建并改进现有的作战网络提供了理论依据。     

Index policies for the routing of background jobs

Arriving (generic) jobs may be processed at one of several service stations, but only when no other (dedicated) jobs are waiting there. We consider the problem of how to route these incoming background jobs to make best use of the spare service capacity available at the stations. We develop an approximative approach to Whittle's proposal for restless bandits to obtain an index policy for routing. The indices concerned are increasing and nonlinear in the station workload. A numerical study testifies to the strong performance of the index policies developed. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Dynamic inventory and pricing models for competing retailers

We address infinite‐horizon models for oligopolies with competing retailers under demand uncertainty. We characterize the equilibrium behavior which arises under simple wholesale pricing schemes. More specifically, we consider a periodic review, infinite‐horizon model for a two‐echelon system with a single supplier servicing a network of competing retailers. In every period, each retailer faces a random demand volume, the distribution of which depends on his own retail price as well as those charged by possibly all competing retailers. We also derive various comparative statics results regarding the impact several exogenous system parameters (e.g., cost or distributional parameters) have on the equilibrium decisions of the retailers as well as their expected profits. We show that certain monotonicity properties, engrained in folklore as well as in known inventory models for centralized systems, may break down in decentralized chains under retailer competition. Our results can be used to optimize the aggregate profits in the supply chain (i.e., those of the supplier and all retailers) by implementing a specific wholesale pricing scheme. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

在C#中通过数据库实现树视图无级动态维护

就树视图与数据库的结合实现树视图的无级动态维护提出了一种解决方法 ,进而拓展了树视图的功能 ,使其能够得到更多的使用。     

用动态模拟方法实现C程序输入变量的取值分析

程序输入变量取值范围的确定对于测试数据的选取,尤其对边界值分析,有着直接的指导作用.一般情形下,通过对源程序进行数据流和相关性分析,可实现输入变量的取值分析.但对某些有特殊取值限制要求的表达式,用静态分析方法,难以实现其输入变量的取值分析.为此,采用动态模拟的方法,对有特殊取值限制要求的表达式,进行输入变量的取值分析.实验表明,该方法是行之有效的.     

火炮动态后坐装置有限元分析与优化

活塞缸是火炮动态后坐装置中的关键部件,其结构强度设计是整个实验装置强度设计的核心。利用I-DEAS软件,在对其进行实体建模和有限元网格划分的基础上,计算了活塞缸整体的应力应变值,得到了活塞缸工作时的应力应变图,并对其结构中应力状况恶劣的部位进行了结构优化。     

Scheduling with centralized and decentralized batching policies in concurrent open shops

This article considers batch scheduling with centralized and decentralized decisions. The context of our study is concurrent open shop scheduling where the jobs are to be processed on a set of independent dedicated machines, which process designated operations of the jobs in batches. The batching policy across the machines can be centralized or decentralized. We study such scheduling problems with the objectives of minimizing the maximum lateness, weighted number of tardy jobs, and total weighted completion time, when the job sequence is determined in advance. We present polynomial time dynamic programming algorithms for some cases of these problems and pseudo‐polynomial time algorithms for some problems that are NP‐hard in the ordinary sense. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 17–27, 2011     

Cache漏流功耗的自适应优化:动态容量调整

当集成电路制造工艺水平发展到超深亚微米阶段,漏流功耗所占的比例越来越大,成为微处理器功耗的重要来源.漏流功耗同电压、漏电流和晶体管数量等因素密切相关.Cache是微处理器中面积较大的部件,对其漏流功耗进行优化是微处理器低功耗设计的首要任务.除了采取工艺上的改进措施外,cache漏流功耗可以通过把握或改变cache的工作...     

Dynamic pricing under first order Markovian competition

We evaluate the effect of competition on prices, profits, and consumers' surplus in multiperiod, finite horizon, dynamic pricing settings. In our base model, a single myopic consumer visits two competing retailers, who offer identical goods, in a (first order Markovian) probabilistic fashion—if the posted price exceeds the consumer's valuation for the good, he returns to the same store in the following period with a certain probability. We find that even a small reduction in the return probability from one—which corresponds to the monopoly case at which prices decline linearly—is sufficient to revert the price decline from a linear into an exponential shape. Each retailer's profit is particularly sensitive to changes in his return probability when it is relatively high, and is maximized under complete loyalty behavior (i.e., return probability is one). On the other hand, consumer surplus is maximized under complete switching behavior (i.e., return probability is zero). In the presence of many similar consumers, the insights remain valid. We further focus on the extreme scenario where all consumers follow a complete switching behavior, to derive sharp bounds, and also consider the instance where, in this setting, myopic consumers are replaced with strategic consumers. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011